vertex degree

Besides, by establishing vertex degree distance matrix, the traditional algorithm for MCI is simplified and the calculating efficiency, veracity, and program attainability for MCi are im-proved.

此外，通过建立点价距离矩阵，简化了传统MCI的计算方法，使MCI的计算具有效率高、不易出错等优点，便于MCI计算程序化。

Then it is proved that the smallest vertex degree, vertex connectivity and link connectivity are all n, which is holding the best connectivity the same as the hypercube and the crossed cube.

然后证明了n维HCH-立方体互连网络的最小顶点度数和顶点连通度和边连通度为n，保持了超立方体和交叉立方体的最高连通度的优点；

Compared with common quadratic elements, this kind of interpolation method achieves the same accuracy by adding a rotation degree of freedom on every vertex without using midpoints of edges or interior points.

和一般的二次单元相比较，这种插值方法不需要使用单元边中点或者内部节点进行插值，仅在每个顶点上增加一个转角自由度就可以得到和二次元相当的精度；

Applying the De Caen's inequality of sum of the squares of the degree and Cauchy's inequality, we obtain a strict lower bound and a strict upper bound of the largest Laplace eigenvalues only in terms of vertex number of a unicycle graph.

利用图度平方和的De Caen不等式和Cauchy不等式给出单圈图的最大Laplace特征值仅依赖于顶点数的严格的上下界；